For the importance of the relationship between information and parity, the generator matrix and the parity-check matrix of every code have been discussed. 由于信息码元与校验码元之间关系的重要性,对每一种码的生成矩阵和校验矩阵均进行了讨论。
A fast testing algorithm for dynamic RAM board over 32K words with parity generator/ checker is presented. 本文提供了一种大容量、带有奇偶校验电路的动态RAM扩充板的快速测试法。
Based on rank distance codes, rank distance BCH codes are proposed, the form of parity check matrices of them are given and the condition that roots of generator polynomial must satisfy are discussed when the given rank distance BCH code is maximum rank distance BCH code. 本文基于秩距离码提出了秩距离BCH码,给出了其校验矩阵的形式,并讨论了所给秩距离BCH码为最大秩距离BCH码时,码的生成多项式的根应满足的条件。